0.04/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.04/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.32 % Computer : n031.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 1200 0.12/0.32 % WCLimit : 120 0.12/0.32 % DateTime : Tue Jul 13 16:15:29 EDT 2021 0.12/0.32 % CPUTime : 0.12/0.32 % Number of cores: 8 0.12/0.32 % Python version: Python 3.6.8 0.12/0.33 # Version: 2.6rc1-ho 0.12/0.33 # No SInE strategy applied 0.12/0.33 # Trying AutoSched0 for 59 seconds 0.16/0.36 # AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN 0.16/0.36 # and selection function SelectComplexExceptUniqMaxHorn. 0.16/0.36 # 0.16/0.36 # Preprocessing time : 0.029 s 0.16/0.36 # Presaturation interreduction done 0.16/0.36 0.16/0.36 # Proof found! 0.16/0.36 # SZS status Theorem 0.16/0.36 # SZS output start CNFRefutation 0.16/0.36 thf(mbox, axiom, (mbox)=(^[X20:$i > $o, X21:$i]:![X22:$i]:(~(rel @ X21 @ X22)|X20 @ X22)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mbox)). 0.16/0.36 thf(mbox_generic, axiom, (mbox_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:![X16:$i]:(~(X15 @ X3 @ X16)|X4 @ X16)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mbox_generic)). 0.16/0.36 thf(mdia, axiom, (mdia)=(^[X23:$i > $o, X24:$i]:?[X25:$i]:(rel @ X24 @ X25&X23 @ X25)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mdia)). 0.16/0.36 thf(mdia_generic, axiom, (mdia_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:?[X16:$i]:(X15 @ X3 @ X16&X4 @ X16)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mdia_generic)). 0.16/0.36 thf(ax17, axiom, mvalid @ (mforall_indset @ (^[X18:mu > $i > $o]:mforall_indset @ (^[X19:mu > $i > $o]:mimplies @ (mbox @ (mforall_ind @ (^[X1:mu]:mequiv @ (X18 @ X1) @ (X19 @ X1)))) @ (mequiv @ (p @ X18) @ (p @ X19))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax17)). 0.16/0.36 thf(mimplies, axiom, (mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3=>X5 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mimplies)). 0.16/0.36 thf(mequiv, axiom, (mequiv)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(X4 @ X3<=>X5 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mequiv)). 0.16/0.36 thf(mforall_ind, axiom, (mforall_ind)=(^[X6:mu > $i > $o, X3:$i]:![X1:mu]:X6 @ X1 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mforall_ind)). 0.16/0.36 thf(mforall_indset, axiom, (mforall_indset)=(^[X7:(mu > $i > $o) > $i > $o, X3:$i]:![X8:mu > $i > $o]:X7 @ X8 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mforall_indset)). 0.16/0.36 thf(mvalid, axiom, (mvalid)=(^[X4:$i > $o]:![X3:$i]:X4 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mvalid)). 0.16/0.36 thf(possible_instantiation_of_the_positive, conjecture, mvalid @ (mforall_indset @ (^[X17:mu > $i > $o]:mimplies @ (p @ X17) @ (mdia @ (mexists_ind @ (^[X1:mu]:X17 @ X1))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', possible_instantiation_of_the_positive)). 0.16/0.36 thf(mexists_ind, axiom, (mexists_ind)=(^[X11:mu > $i > $o, X3:$i]:?[X1:mu]:X11 @ X1 @ X3), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mexists_ind)). 0.16/0.36 thf(ax16, axiom, mvalid @ (mnot @ (p @ (^[X1:mu, X3:$i]:(X1)!=(X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', ax16)). 0.16/0.36 thf(mnot, axiom, (mnot)=(^[X4:$i > $o, X3:$i]:~(X4 @ X3)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL016^0.ax', mnot)). 0.16/0.36 thf(c_0_14, axiom, (mbox)=(^[X20:$i > $o, X21:$i]:![X22:$i]:(~(rel @ X21 @ X22)|X20 @ X22)), inference(apply_def,[status(thm)],[mbox, mbox_generic])). 0.16/0.36 thf(c_0_15, axiom, (mdia)=(^[X23:$i > $o, X24:$i]:?[X25:$i]:(rel @ X24 @ X25&X23 @ X25)), inference(apply_def,[status(thm)],[mdia, mdia_generic])). 0.16/0.36 thf(c_0_16, plain, ![X97:$i, X103:mu > $i > $o, X104:mu > $i > $o]:(![X105:$i]:(~rel @ X97 @ X105|![X106:mu]:(X103 @ X106 @ X105<=>X104 @ X106 @ X105))=>(p @ X103 @ X97<=>p @ X104 @ X97)), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax17, mimplies]), mequiv]), mforall_ind]), mforall_indset]), c_0_14]), mvalid])])). 0.16/0.36 thf(c_0_17, negated_conjecture, ~(![X54:$i, X59:mu > $i > $o]:(p @ X59 @ X54=>?[X60:$i]:(rel @ X54 @ X60&?[X61:mu]:X59 @ X61 @ X60))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[possible_instantiation_of_the_positive]), mimplies]), mforall_indset]), mexists_ind]), c_0_15]), mvalid])). 0.16/0.36 thf(c_0_18, plain, ![X112:$i, X113:mu > $i > $o, X114:mu > $i > $o]:(((~p @ X113 @ X112|p @ X114 @ X112|rel @ X112 @ (esk2_3 @ X112 @ X113 @ X114))&(~p @ X114 @ X112|p @ X113 @ X112|rel @ X112 @ (esk2_3 @ X112 @ X113 @ X114)))&(((~p @ X113 @ X112|p @ X114 @ X112|(~X113 @ (esk3_3 @ X112 @ X113 @ X114) @ (esk2_3 @ X112 @ X113 @ X114)|~X114 @ (esk3_3 @ X112 @ X113 @ X114) @ (esk2_3 @ X112 @ X113 @ X114)))&(~p @ X114 @ X112|p @ X113 @ X112|(~X113 @ (esk3_3 @ X112 @ X113 @ X114) @ (esk2_3 @ X112 @ X113 @ X114)|~X114 @ (esk3_3 @ X112 @ X113 @ X114) @ (esk2_3 @ X112 @ X113 @ X114))))&((~p @ X113 @ X112|p @ X114 @ X112|(X113 @ (esk3_3 @ X112 @ X113 @ X114) @ (esk2_3 @ X112 @ X113 @ X114)|X114 @ (esk3_3 @ X112 @ X113 @ X114) @ (esk2_3 @ X112 @ X113 @ X114)))&(~p @ X114 @ X112|p @ X113 @ X112|(X113 @ (esk3_3 @ X112 @ X113 @ X114) @ (esk2_3 @ X112 @ X113 @ X114)|X114 @ (esk3_3 @ X112 @ X113 @ X114) @ (esk2_3 @ X112 @ X113 @ X114)))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])). 0.16/0.36 thf(c_0_19, negated_conjecture, ![X110:$i, X111:mu]:(p @ epred2_0 @ esk1_0&(~rel @ esk1_0 @ X110|~epred2_0 @ X111 @ X110)), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])). 0.16/0.36 thf(c_0_20, plain, ![X32:$i, X31:mu]:(epred1_2 @ X31 @ X32<=>(X31)!=(X31)), introduced(definition)). 0.16/0.36 thf(c_0_21, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(p @ X8 @ X3|rel @ X3 @ (esk2_3 @ X3 @ X8 @ X6)|~p @ X6 @ X3), inference(split_conjunct,[status(thm)],[c_0_18])). 0.16/0.36 thf(c_0_22, negated_conjecture, p @ epred2_0 @ esk1_0, inference(split_conjunct,[status(thm)],[c_0_19])). 0.16/0.36 thf(c_0_23, plain, ![X117:$i, X118:mu]:((~epred1_2 @ X118 @ X117|(X118)!=(X118))&((X118)=(X118)|epred1_2 @ X118 @ X117)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])). 0.16/0.36 thf(c_0_24, negated_conjecture, ![X1:mu, X3:$i]:(~rel @ esk1_0 @ X3|~epred2_0 @ X1 @ X3), inference(split_conjunct,[status(thm)],[c_0_19])). 0.16/0.36 thf(c_0_25, negated_conjecture, ![X6:mu > $i > $o]:(rel @ esk1_0 @ (esk2_3 @ esk1_0 @ X6 @ epred2_0)|p @ X6 @ esk1_0), inference(spm,[status(thm)],[c_0_21, c_0_22])). 0.16/0.36 thf(c_0_26, plain, ![X28:$i]:~p @ epred1_2 @ X28, inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax16, mnot]), mvalid]), c_0_20])])). 0.16/0.36 thf(c_0_27, plain, ![X3:$i, X1:mu]:(~epred1_2 @ X1 @ X3|(X1)!=(X1)), inference(split_conjunct,[status(thm)],[c_0_23])). 0.16/0.36 thf(c_0_28, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(p @ X8 @ X3|X8 @ (esk3_3 @ X3 @ X8 @ X6) @ (esk2_3 @ X3 @ X8 @ X6)|X6 @ (esk3_3 @ X3 @ X8 @ X6) @ (esk2_3 @ X3 @ X8 @ X6)|~p @ X6 @ X3), inference(split_conjunct,[status(thm)],[c_0_18])). 0.16/0.36 thf(c_0_29, negated_conjecture, ![X1:mu, X6:mu > $i > $o]:(p @ X6 @ esk1_0|~epred2_0 @ X1 @ (esk2_3 @ esk1_0 @ X6 @ epred2_0)), inference(spm,[status(thm)],[c_0_24, c_0_25])). 0.16/0.36 thf(c_0_30, plain, ![X107:$i]:~p @ epred1_2 @ X107, inference(variable_rename,[status(thm)],[c_0_26])). 0.16/0.36 thf(c_0_31, plain, ![X1:mu, X3:$i]:~epred1_2 @ X1 @ X3, inference(cn,[status(thm)],[c_0_27])). 0.16/0.36 thf(c_0_32, negated_conjecture, ![X6:mu > $i > $o]:(X6 @ (esk3_3 @ esk1_0 @ X6 @ epred2_0) @ (esk2_3 @ esk1_0 @ X6 @ epred2_0)|p @ X6 @ esk1_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_22]), c_0_29])). 0.16/0.36 thf(c_0_33, plain, ![X3:$i]:~p @ epred1_2 @ X3, inference(split_conjunct,[status(thm)],[c_0_30])). 0.16/0.36 thf(c_0_34, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33]), ['proof']). 0.16/0.36 # SZS output end CNFRefutation 0.16/0.36 # Proof object total steps : 35 0.16/0.36 # Proof object clause steps : 11 0.16/0.36 # Proof object formula steps : 24 0.16/0.36 # Proof object conjectures : 8 0.16/0.36 # Proof object clause conjectures : 5 0.16/0.36 # Proof object formula conjectures : 3 0.16/0.36 # Proof object initial clauses used : 6 0.16/0.36 # Proof object initial formulas used : 14 0.16/0.36 # Proof object generating inferences : 4 0.16/0.36 # Proof object simplifying inferences : 3 0.16/0.36 # Training examples: 0 positive, 0 negative 0.16/0.36 # Parsed axioms : 50 0.16/0.36 # Removed by relevancy pruning/SinE : 0 0.16/0.36 # Initial clauses : 36 0.16/0.36 # Removed in clause preprocessing : 26 0.16/0.36 # Initial clauses in saturation : 10 0.16/0.36 # Processed clauses : 33 0.16/0.36 # ...of these trivial : 0 0.16/0.36 # ...subsumed : 2 0.16/0.36 # ...remaining for further processing : 31 0.16/0.36 # Other redundant clauses eliminated : 1 0.16/0.36 # Clauses deleted for lack of memory : 0 0.16/0.36 # Backward-subsumed : 0 0.16/0.36 # Backward-rewritten : 0 0.16/0.36 # Generated clauses : 26 0.16/0.36 # ...of the previous two non-trivial : 14 0.16/0.36 # Contextual simplify-reflections : 1 0.16/0.36 # Paramodulations : 11 0.16/0.36 # Factorizations : 0 0.16/0.36 # NegExts : 3 0.16/0.36 # Equation resolutions : 1 0.16/0.36 # Propositional unsat checks : 0 0.16/0.36 # Propositional check models : 0 0.16/0.36 # Propositional check unsatisfiable : 0 0.16/0.36 # Propositional clauses : 0 0.16/0.36 # Propositional clauses after purity: 0 0.16/0.36 # Propositional unsat core size : 0 0.16/0.36 # Propositional preprocessing time : 0.000 0.16/0.36 # Propositional encoding time : 0.000 0.16/0.36 # Propositional solver time : 0.000 0.16/0.36 # Success case prop preproc time : 0.000 0.16/0.36 # Success case prop encoding time : 0.000 0.16/0.36 # Success case prop solver time : 0.000 0.16/0.36 # Current number of processed clauses : 19 0.16/0.36 # Positive orientable unit clauses : 3 0.16/0.36 # Positive unorientable unit clauses: 0 0.16/0.36 # Negative unit clauses : 4 0.16/0.36 # Non-unit-clauses : 12 0.16/0.36 # Current number of unprocessed clauses: 1 0.16/0.36 # ...number of literals in the above : 3 0.16/0.36 # Current number of archived formulas : 0 0.16/0.36 # Current number of archived clauses : 12 0.16/0.36 # Clause-clause subsumption calls (NU) : 20 0.16/0.36 # Rec. Clause-clause subsumption calls : 20 0.16/0.36 # Non-unit clause-clause subsumptions : 1 0.16/0.36 # Unit Clause-clause subsumption calls : 4 0.16/0.36 # Rewrite failures with RHS unbound : 0 0.16/0.36 # BW rewrite match attempts : 0 0.16/0.36 # BW rewrite match successes : 0 0.16/0.36 # Condensation attempts : 0 0.16/0.36 # Condensation successes : 0 0.16/0.36 # Termbank termtop insertions : 2408 0.16/0.36 0.16/0.36 # ------------------------------------------------- 0.16/0.36 # User time : 0.028 s 0.16/0.36 # System time : 0.006 s 0.16/0.36 # Total time : 0.034 s 0.16/0.36 # Maximum resident set size: 1708 pages 0.16/0.36 EOF